Lukasiewicz filters and their Cartesian products
نویسنده
چکیده
The paper deals with Lukasiewicz filters. It analyzes some of their possible constructions and their basic properties. The Cartesian product of Lukasiewicz filters is introduced.
منابع مشابه
Lukasiewicz Filters as Convex Combinations of Crisp Filters
In this paper we investigate special types of Lukasiewicz filters. We show their connection to crisp filters. Further, we introduce the notion of Lukasiewicz ideal as a set-function which is in some sense complementary to Lukasiewicz filters.
متن کاملFuzzy Preference Relations and Lukasiewicz Filters
This paper is devoted to construction of fuzzy preference relations and to showing how this construction is connected with Lukasiewicz filters and TL-evaluators. We will study also extensions of Lukasiewicz filters on subsets of some X 6= ∅ to TL-evaluators on the system (lattice) of fuzzy functions f : X → [0, 1].
متن کاملCartesian closed subcategories of topological fuzzes
A category $mathbf{C}$ is called Cartesian closed provided that it has finite products and for each$mathbf{C}$-object $A$ the functor $(Atimes -): Ara A$ has a right adjoint. It is well known that the category $mathbf{TopFuzz}$ of all topological fuzzes is both complete and cocomplete, but it is not Cartesian closed. In this paper, we introduce some Cartesian closed subcategories of this cat...
متن کاملTHE CATEGORY OF T-CONVERGENCE SPACES AND ITS CARTESIAN-CLOSEDNESS
In this paper, we define a kind of lattice-valued convergence spaces based on the notion of $top$-filters, namely $top$-convergence spaces, and show the category of $top$-convergence spaces is Cartesian-closed. Further, in the lattice valued context of a complete $MV$-algebra, a close relation between the category of$top$-convergence spaces and that of strong $L$-topological spaces is establish...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کامل